例句與造句

1. As usual, \ oplus denotes addition modulo 2.
2. XOR can also be viewed as addition modulo 2.
3. For example, the cyclic group with 7 elements has the operator addition modulo 7.
4. Consider the abelian group ( that is, the set with addition modulo 4 ), and its subgroup.
5. Does this mean that any other 7 element group will have an operator that is isomorphic to addition modulo 7?
6. It's difficult to find addition modulo in a sentence. 用addition modulo造句挺難的
7. The cipher uses only the operations of addition modulo 2 32, exclusive or, and rotation by a fixed number of bits.
8. Sometimes the elements of I _ c may be defined by a vector addition modulo the simulation space's dimension to realize toroidal topologies:
9. Unlike basic Nihilist, the additive was added by non-carrying addition ( digit-wise addition modulo 10 ), thus producing a more uniform output which doesn't leak as much information.
10. Z 3 = { 0, 1, 2 } with addition modulo 3; group element 0 corresponds to the identity permutation e, group element 1 to permutation ( 123 ), and group element 2 to permutation ( 132 ).
11. The oracle maps the state | x \ rangle | y \ rangle to | x \ rangle | y \ oplus f ( x ) \ rangle, where \ oplus is addition modulo 2 ( see below for details of implementation ).
12. A more precise specification appears below as pseudocode, although in this form the row / column pattern is more difficult to see . ?" is addition modulo 2 32, x ?" = y is an abbreviation for x = x ?" y.
13. For another example, every abelian group of order 8 is isomorphic to either "'Z "'8 ( the integers 0 to 7 under addition modulo 8 ), ( the odd integers 1 to 15 under multiplication modulo 16 ), or.
14. As noted above, since exclusive disjunction is identical to addition modulo 2, the bitwise exclusive disjunction of two " n "-bit strings is identical to the standard vector of addition in the vector space ( \ Z / 2 \ Z ) ^ n.
15. In the first key-mixing stage, the plaintext block is divided into eight 8-bit segments, and subkeys are added using either addition modulo 256 ( denoted by a " + " in a square ) or XOR ( denoted by a " + " in a circle ).
16. One reason for this name may be that this is the only root from which you can calculate the rest of the n-1 roots by incrementally adding 2 \ pi / n to the angle and " not " have to calculate the angle additions modulo 2 \ pi.